BinarySearcher.java

/**
   A class for executing binary searches through an array.
*/
public class BinarySearcher
{  
   /**
      Constructs a BinarySearcher.
      @param anArray a sorted array of integers
   */
   public BinarySearcher(int[] anArray)
   {
      a = anArray;
   }
   
   /**
      Finds a value in a sorted array, using the binary
      search algorithm.
      @param v the value to search
      @return the index at which the value occurs, or -1
      if it does not occur in the array
   */
   public int search(int v)
   {  
      int low = 0;
      int high = a.length - 1;
      while (low <= high)
      {
         int mid = (low + high) / 2;
         int diff = a[mid] - v;
      
         if (diff == 0) // a[mid] == v
            return mid;
         else if (diff < 0) // a[mid] < v 
            low = mid + 1;
         else
            high = mid - 1;         
      }
      return -1;
   }
   
   public int search(int v, int l, int h)
   {  
        int mid = (l + h) / 2;
        int diff = a[mid] - v;
        
        if (diff == 0) // a[mid] == v
             return mid;
        else if (diff < 0) // a[mid] < v 
             l = mid + 1;
        else
             h = mid - 1;
        
        if(l >= h)
             return -1;
        
        return search(v, l,  h);
   }

   private int[] a;
}